A totally ordered Baire space for which Blumberg’s theorem fails

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Characterization of the Least Cardinal for Which the Baire Category Theorem Fails

Let k be the least cardinal such that the real Une can be covered by k many nowhere dense sets. We show that k can be characterized as the least cardinal such that "infinitely equal" reals fail to exist for families of cardinality k. Let Baire (k) stand for: "The real line is not the union of k many nowhere dense sets (a set is nowhere dense iff its closure has no interior)". The property was e...

متن کامل

The Baire Space Ordered by Eventual Domination: Spectra

These are notes of the author’s talk on various types of spectra associated naturally with the eventually domination ordering on the Baire space ωω , given at the General Topology Symposium at Kobe University in December 2002. The report comes in two parts: in the first half, we present an outline of the lecture, giving ideas of some of the arguments without going too deeply into details. The s...

متن کامل

On the Baire Category Theorem

Let T be a topological structure and let A be a subset of the carrier of T . Then IntA is a subset of T . Let T be a topological structure and let P be a subset of the carrier of T . Let us observe that P is closed if and only if: (Def. 1) −P is open. Let T be a non empty topological space and let F be a family of subsets of T . We say that F is dense if and only if: (Def. 2) For every subset X...

متن کامل

Totally Ordered Commutative Semigroups

Let 5( + , < ) be a system consisting of a set S endowed with an associative binary operation + and a total ( = linear = simple) order relation < . The composition + and the relation < may be connected by either or both of the following conditions. MC (Monotone Condition). If a and b are elements of 5 such that ax+y ...

متن کامل

Logics and Automata for Totally Ordered Trees

A totally ordered tree is a tree equipped with an additional total order on its nodes. It provides a formal model for data that comes with both a hierarchical and a sequential structure; one example for such data are natural language sentences, where a sequential structure is given by word order, and a hierarchical structure is given by grammatical relations between words. In this paper, we stu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1973

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1973-0324630-4